Constraint-Based Strategies for Matchmakers

نویسندگان

  • Eugene C. Freuder
  • Richard J. Wallace
چکیده

We describe a paradigm for content-focused matchmaking, based on a recently proposed model for constraint acquisition-and-satisfaction. Matchmaking agents are conceived as constraint-based solvers that interact with other, possibly human, agents (Customers). The Matchmaker provides potential solutions ("suggestions") based on partial knowledge, while gaining further information about the problem itself from the other agent through the latter’s evaluation of these suggestions. The dialog between Matchmaker and Customer results in iterative improvement of solution quality, as demonstrated in simple simulations. This paradigm also supports "suggestion strategies" for finding acceptable solutions more efficiently or for increasing the amount of information obtained from the Customer.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluating Semantic Web Service Matchmaking Effectiveness Based on Graded Relevance

Semantic web services (SWS) promise to take service oriented computing to a new level by allowing to semi-automate timeconsuming programming tasks. At the core of SWS are solutions to the problem of SWS matchmaking, i.e., the problem of comparing semantic goal descriptions with semantic offer descriptions to determine services able to fulfill a given request. Approaches to this problem have so ...

متن کامل

A service concept recommendation system for enhancing the dependability of semantic service matchmakers in the service ecosystem environment

A Service Ecosystem is a biological view of the business and software environment, which is comprised of a Service Use Ecosystem and a Service Supply Ecosystem. Service matchmakers play an important role in ensuring the connectivity between the two ecosystems. Current matchmakers attempt to employ ontologies to disambiguate service consumers’ service queries by semantically classifying service ...

متن کامل

The Matchmaker’s Dilemma

Matchmaking is a complex process and requires tremendous expertise. Matchmakers in various industries often advertise proprietary technologies that would presumably help users find an ideal match in a shorter period of time. However, matchmakers might seek to deliberately reduce their matchmaking effectiveness because users would thus remain clients for a longer time and hence pay more fees. Th...

متن کامل

Distributed Grid Resource Discovery with Matchmakers

The Grid provides mechanisms to share dynamic, heterogeneous, distributed resources spanned across multiple administrative domains. Resources required to execute a job are identified from the resource pool based on the desired set of attributes of the resources that exhibit various degrees of dynamism. A Resource Discovery service provides mechanisms to identify the set of resources that are ca...

متن کامل

Power Allocation Strategies in Block-Fading Two-Way Relay Networks

This paper aims at investigating the superiority of power allocation strategies, based on calculus of variations in a point-to-point two-way relay-assisted channel incorporating the amplify and forward strategy. Single and multilayer coding strategies for two cases of having and not having the channel state information (CSI) at the transmitters are studied, respectively. Using the notion of cal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003